Towards Path Planning Algorithm Combining with A-Star Algorithm and Dynamic Window Approach Algorithm

نویسندگان

چکیده

In the Automated Guided Vehicle (AGV) warehouse automatic guided vehicle system, path planning algorithm for intelligent logistics vehicles is a key factor to ensure stable and efficient operation of system. However, existing algorithms have problems such as single designing route inability intelligently evade moving barriers. The academic community has proposed various solutions these problems, although they improved efficiency quality some extent, not completely solved poor safety in planning, high number inflection points, smoothness, easily getting stuck deadlocks, fully considered running cost practical implementation difficulty algorithms. To address issues, article deeply researched traditional A* scheme Dynamic Window Approach (DWA) technology method according fusion DWA technology. A by introducing sub-node optimization solve instance global easy deadlock. Moreover, reduced amount reversal locations increased consistency improving evaluation function removing redundant points algorithm. Finally, integrating algorithm, achieved dynamic obstacle avoidance capabilities objects real world. Our simulations-based results on MATLAB framework show that significantly improves length, time, environmental adaptability compared algorithms, basically meets requirements AGV system vehicles.

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Robot Path Planning Using Cellular Automata and Genetic Algorithm

In path planning Problems, a complete description of robot geometry, environments and obstacle are presented; the main goal is routing, moving from source to destination, without dealing with obstacles. Also, the existing route should be optimal. The definition of optimality in routing is the same as minimizing the route, in other words, the best possible route to reach the destination. In most...

متن کامل

A Multiple Mobile Robots Path planning Algorithm Based on A-star and Dijkstra Algorithm

Path planning algorithm is a key issue among robot control areas. In practical engineering applications, traditional methods have some limitations to a certain degrees in key aspects of cost, efficiency, security, flexibility, portability, etc. Through the analysis and comparison of A-star algorithm and Dijkstra algorithm, path planning problem supporting multiple cars run parallely (PPSMC for ...

متن کامل

A set-based global dynamic window algorithm for robust and safe mobile robot path planning

In recent papers we proposed a novel approach for mobile robot localization based on set theoretic methods. In this paper we complete this set-based approach by introducing a novel set-based mobile robot path planning algorithm, which can handle the outputs of the set-based localization. In opposite to most known path planning algorithms the approach considers not only kinematic and dynamic con...

متن کامل

PSO-Based Path Planning Algorithm for Humanoid Robots Considering Safety

In this paper we introduce an improvement in the path planning algorithm for the humanoid soccer playing robot which uses Ferguson splines and PSO (Particle Swarm Optimization). The objective of the algorithm is to find a path through other playing robots to the ball, which should be as short as possible and also safe enough. Ferguson splines create preliminary paths using random generated para...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: International Journal of Advanced Computer Science and Applications

سال: 2023

ISSN: ['2158-107X', '2156-5570']

DOI: https://doi.org/10.14569/ijacsa.2023.0140655